Parallel algorithms for solvable permutation groups
نویسندگان
چکیده
منابع مشابه
Expanding Generator Sets for Solvable Permutation Groups
Let G = 〈S〉 be a solvable permutation group given as input by the generating set S. I.e. G is a solvable subgroup of the symmetric group Sn. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size Õ(n2) for G. More precisely, given a λ < 1, we can compute a subset T ⊂ G of size Õ(n2) ( 1 λ )O(1) such that the undirected Cayley graph Cay(G,T ) is a λ-s...
متن کاملOn solvable minimally transitive permutation groups
We investigate properties of finite transitive permutation groups (G, Ω) in which all proper subgroups of G act intransitively on Ω. In particular, we are interested in reduction theorems for minimally transitive representations of solvable groups.
متن کاملNear-Optimal Expanding Generating Sets for Solvable Permutation Groups
Let G = 〈S〉 be a solvable permutation group of the symmetric group Sn given as input by the generating set S. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size Õ(n) for G. More precisely, the algorithm computes a subset T ⊂ G of size Õ(n)(1/λ) such that the undirected Cayley graph Cay(G, T ) is a λ-spectral expander (the Õ notation suppresses lo...
متن کاملNear-Optimal Expanding Generator Sets for Solvable Permutation Groups
Let G = 〈S〉 be a solvable subgroup of the symmetric group Sn given as input by the generator set S. We give a deterministic polynomialtime algorithm that computes an expanding generator set of size Õ(n) for G. As a byproduct of our proof, we obtain a new explicit construction of ε-bias spaces of size Õ(npoly(log d))( 1 ε ) for the groups Zd .
متن کاملFast Parallel Permutation Algorithms
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage We present a simple algorithm with run time O n p logn and an improved algorithm with run time O n p logn log log n p Both algorithms require n additional global bits and O local storage per processor If pre x summation is supported at the instruction level the run time of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90044-x